/*  KDevelop 4.3.1
 *  BeautifulStrings.cxx
 *
 * 	Author : Pallab
 * 	Created on: 11:58:32 AM - 2013:1:26
 * 	"I have not failed, I have just found 10000 ways that won't work."
 */
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i,frm,upto) for( int i=(frm),_i=(upto);(i) < (_i) ; ++i )
#define foD(i,frm,upto) for( int i=(frm),_i=(upto);(i) >= (_i) ; --i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define dbg(...)       fprintf(stderr, __VA_ARGS__)
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait ( double seconds ) {
    double endtime = clock() + ( seconds * CLOCKS_PER_SEC );
    while ( clock() < endtime ) {
        ;
    }
}
template<class T>
    inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while ( c<33 ) c=getchar();
    while ( c>33 ) {
        if ( c=='-' ) {
            neg=true;
        } else {
            a= ( a*10 ) + ( c-'0' );
        }
        c=getchar();
    }
    return neg?-a:a;
}
string buffer;
int bufferLen;
inline void read() {
    getline ( cin,buffer );
    bufferLen= LN ( buffer );
}
inline void proc() {
    map<char,int> mp;
    foR ( i,0,bufferLen ) {
        if ( isalpha ( buffer[i] ) ) mp[ tolower ( buffer[i] ) ]++;
    }
    vector< pair<int,int> >vt;
    for ( auto &x:mp ) {
        vt.pb ( mk ( x.second,x.first ) );
    }
    sort ( vt.begin(),vt.end(), greater<pair<int,int> >() );
    int beautySum=0;
    for ( int i=0,_i=SZ ( vt ),point=26; i<_i; ++i,--point ) {
        beautySum+= ( point*vt[i].first );
    }
    cout<<beautySum<<"\n";
}
int main() {
    int kase = 1;
#if defined( xerxes_pc )
    //freopen ( "beautiful_stringstxt.txt", "r", stdin );
    freopen ( "Beautiful_strings.in4" , "r",stdin );
    freopen ( "beautiful_stringstxt_out.txt", "w", stdout );
    kase = 1;
#endif
    kase=fastIn<int>();
    for ( int i=1; i<=kase; ++i ) {
        read();
        cout<<"Case #"<<i<<": ";
        proc();
    }
    return 0;
}

// kate: indent-mode cstyle; indent-width 4; replace-tabs on; 


